Combinatorial Problems in Geometry and Number Theory
نویسندگان
چکیده
In a previous paper (given at the International Congress of Mathematicians at Nice 1970) entitled "On the application of combinatorial analysis to number theory geometry and analysis", I discussed many combinatorial results and their applications . I will refer to this paper as I (as much as possible I will try to avoid overlap with this paper) . First I discuss those problems mentioned in I where significant progress has been made . 1 . Let f(n) be the smallest integer so that if there are f(n) points in the plane no three on a line, then there are always n of them which form the vertices of a convex n-gon . was discussed in I . Szekeres and I proved that 2n-4 (1) 2n-2 + 1 s f(n) 5 n-2 This problem of E . Klein (Mrs Szekeres)
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملResearch Statement Jeong -
My research interests lie in Discrete Mathematics, especially Combinatorics, Graph Theory, Combinatorial Geometry, and Combinatorial Number Theory. For me, the most exciting aspect of working in discrete mathematics is the prevalence of combinatorial problems in various fields of mathematics and various applications to Computer Science and real life problems such as building transmitters in a t...
متن کاملJeong - Hyun
My research interests lie in Discrete Mathematics, especially Combinatorics, Graph Theory, Combinatorial Geometry, and Combinatorial Number Theory. For me, the most exciting aspect of working in discrete mathematics is the prevalence of combinatorial problems in various fields of mathematics and various applications to Computer Science and real life problems such as building transmitters in a t...
متن کاملTHIN WALLED STEEL SECTIONS’ FREE SHAPE OPTIMIZATION USING CHARGED SYSTEM SEARCH ALGORITHM
Graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. The combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. This paper presents a Charged System Search (CSS) algorithm for the free shape optimizations of thin-wall...
متن کاملDegenerating Geometry to Combinatorics : Research Proposal for
A central appeal of algebraic geometry is that its functions are polynomials which can be written down as finite expressions. This makes the theory naturally combinatorial, in that polynomials are made up of a finite number of terms which interact through discrete rules. In practice, however, the operations performed on these polynomials are usually too complex for combinatorial methods to be o...
متن کاملMichael Tait: Research Statement
My research uses algebraic and geometric methods to prove theorems in extremal combinatorics. Going the other way, I also use combinatorial methods to prove algebraic results. Algebraic methods are deeply embedded in my work and nearly all of my success in graph theoretic research has come from attacking purely combinatorial problems through the lens of algebra, combinatorial number theory, or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004